package leetcode;

public class _0162 {
    /**
     * 寻找峰值
     */
    class Solution {
        public int findPeakElement(int[] nums) {
            int n = nums.length;
            int left =0;
            int right = n-2;
            while(left<=right){
                int mid = left+(right-left)/2;
                if(nums[mid]<nums[mid+1]){
                    left=mid+1;
                }else{
                    right=mid-1;
                }
            }
            return left;
        }
    }
}
